Clique partitions of the cocktail party graph

نویسندگان

  • David A. Gregory
  • S. McGuinness
  • Walter D. Wallis
چکیده

For our purposes, graphs have no loops or multiple edges. Aside from this, our terminology follows that of Bondy and Murty [1]. A clique is a complete subgraph. A clique partition of a graph G is a family ~ of cliques of G such that each edge of G is in precisely one member of q¢. The clique partition number, cp(G), is the minimum of the cardinalities of the clique partitions of G. Let To denote the graph on v = 2 n vertices ui, i = l , 2 , . . . , v with ui nonadjacent to ui+n for each i = 1, 2 , . . . , n. All other pairs of vertices are adjacent. This unique ( v 2)-regular graph on v vertices is called the cocktail party graph.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independent sets in edge-clique graphs

We show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in O(n4) time. We show that the independent set problem on edge-clique g...

متن کامل

Independent sets in edge-clique graphs II

We show that edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in polynomial time. We show that the independent set problem on edge-clique ...

متن کامل

Pairwise balanced designs and sigma clique partitions

In this paper, we are interested inminimizing the sum of block sizes in a pairwise balanced design, where there are some constraints on the size of one block or the size of the largest block. For every positive integers n,m, wherem ≤ n, letS (n,m) be the smallest integer s for which there exists a PBD on n points whose largest block has sizem and the sum of its block sizes is equal to s. Also, ...

متن کامل

Edge-clique graphs of cocktail parties have unbounded rankwidth

In an attempt to find a polynomial-time algorithm for the edgeclique cover problem on cographs we tried to prove that the edge-clique graphs of cographs have bounded rankwidth. However, this is not the case. In this note we show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth.

متن کامل

Computing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers

The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 59  شماره 

صفحات  -

تاریخ انتشار 1986